#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
const int ArraySize = 28;
ll a[ArraySize];
void solve()
{
    int N;
    cin >> N;
    int i = 0;
    bool qc = 0;
    int ou = 0;
    int ji = 0;
    for (i = 1; i <= N; i++)
    {
        cin >> a[i];
        if (i > 1 && qc == 0)
        {
            if ((a[i - 1] + a[i]) % 2 == 0)
                qc = 1;
        }
        if (a[i] % 2 == 0)
            ou++;
        else
            ji++;
    }
    if (N == 1 || ((abs(ou - ji) % 2 == 0 || abs(ou - ji) == 1) && qc == 1 && N != 2))
        cout << "qcjj" << endl;
    else
        cout << "zn" << endl;
}
int main()
{
    ll t;
    cin >> t;
    while (t--)
        solve();
    return 0;
}
